Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints
نویسندگان
چکیده
منابع مشابه
Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints
We propose local search algorithms for the vehicle routing problem with soft time window constraints. The time window constraint for each customer is treated as a penalty function, which is very general in the sense that it can be non-convex and discontinuous as long as it is piecewise linear. In our algorithm, we use local search to assign customers to vehicles and to find orders of customers ...
متن کاملAlgorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your perso...
متن کاملSurvey Paper - Time Window Constrained Routing and Scheduling Problems
Full terms and conditions of use:
متن کاملLocal Search Techniques for Scheduling Problems : Algorithms and Software Tools
Local Search meta-heuristics are an emerging class of methods for tackling combinatorial search and optimization problems, which recently have been shown to be very effective for a large number of combinatorial problems. The Local Search techniques are based on the iterative exploration of a solution space: at each iteration, a Local Search algorithm steps from one solution to one of its “neigh...
متن کاملGenetic Local Search Algorithms for Single Machine Scheduling Problems with Release Time
Single machine scheduling problems with release time are the prototypes for other complicated scheduling systems. Genetic local search algorithms are proposed to minimize total weighted completion time. Numerical experiments to evaluate the three embedding local search techniques are done. The results indicate that the Irj+tj rule proposed by Liu and MacCathy (1991) outperform ERT and WSPT.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Science
سال: 2005
ISSN: 0041-1655,1526-5447
DOI: 10.1287/trsc.1030.0085